Automata and Logics for Concurrent Systems: Five Models in Five Pages
نویسنده
چکیده
We survey various automata models of concurrent systems and their connection with monadic second-order logic: finite automata, class memory automata, nested-word automata, asynchronous automata, and message-passing automata.
منابع مشابه
Automata: from logics to algorithms
We review, in a unified framework, translations from five different logics—monadic second-order logic of one and two successors (S1S and S2S), linear-time temporal logic (LTL), computation tree logic (CTL), and modal μ-calculus (MC)—into appropriate models of finite-state automata on infinite words or infinite trees. Together with emptiness-testing algorithms for these models of automata, this ...
متن کاملBinary Multirelations
Binary multirelations associate elements of a set with its subsets; hence they are binary relations of type A × 2. Applications include alternating automata, models and logics for games, program semantics with dual demonic and angelic nondeterministic choices and concurrent dynamic logics. This proof document supports an arXiv article that formalises the basic algebra of multirelations and prop...
متن کاملModal Logic over Higher Dimensional Automata
Higher dimensional automata (HDA) are a model of concurrency [5, 8] that can express most of the traditional partial order models like Mazurkiewicz traces, pomsets, event structures, or Petri nets. Modal logics, interpreted over Kripke structures, are the logics for reasoning about sequential behavior and interleaved concurrency. Modal logic is a well behaved subset of first-order logic; many v...
متن کاملA Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies
The emerging technology of interacting systems calls for new formalisms to ensure their reliability. Concurrent games are paradigmatic abstract models for which several logics have been studied. However, the existing formalisms show certain limitations in face of the range of strategy properties required to address intuitive situations. We propose a generic solution to specify expressive constr...
متن کاملQuantified Mu-Calculus with Decision Modalities for Concurrent Game Structures
The emerging technology of interacting systems calls for new verification methods to ensure their reliability. Concurrent Game Structures are expressive abstract models for which several logics have been studied. Yet, these logics are not sufficiently expressive to support certain strategic situation which arise naturally. We propose a second-order mu-calculus enabling a straightforward specifi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015